First results for a mathematical theory of possibilistic Markov processes

نویسندگان

  • Hugo Janssen
  • Gert de Cooman
  • Etienne E. Kerre
چکیده

We provide basic results for the development of a theory of possibilistic Markov processes. We define and study possibilistic Markov processes and possibilistic Markov chains, and derive a possibilistic analogon of the Chapman-Kolmogorov equation. We also show how possibilistic Markov processes can be constructed using one-step transition possibilities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov‎ ‎processes

‎In the present paper we investigate the $L_1$-weak ergodicity of‎ ‎nonhomogeneous continuous-time Markov processes with general state‎ ‎spaces‎. ‎We provide a necessary and sufficient condition for such‎ ‎processes to satisfy the $L_1$-weak ergodicity‎. ‎Moreover‎, ‎we apply‎ ‎the obtained results to establish $L_1$-weak ergodicity of quadratic‎ ‎stochastic processes‎.

متن کامل

Accelerated decomposition techniques for large discounted Markov decision processes

Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...

متن کامل

Efficient Policies for Stationary Possibilistic Markov Decision Processes

Possibilistic Markov Decision Processes offer a compact and tractable way to represent and solve problems of sequential decision under qualitative uncertainty. Even though appealing for its ability to handle qualitative problems, this model suffers from the drowning effect that is inherent to possibilistic decision theory. The present paper proposes to escape the drowning effect by extending to...

متن کامل

A New Combination of Robust-possibilistic Mathematical Programming for Resilient Supply Chain Network under Disruptions and Uncertainty: A Real Supply Chain (RESEARCH NOTE)

Nowadays, the design of a strategic supply chain network under disruption is one of the most important priorities of the governments. One of the strategic purposes of managers is to supply the sustainable agricultural products and food in stable conditions which require the production of soil nutrients. In this regard, some disruptions such as sanctions and natural disasters have a destructive ...

متن کامل

Encoding Markov logic networks in Possibilistic Logic

Markov logic uses weighted formulas to compactly encode a probability distribution over possible worlds. Despite the use of logical formulas, Markov logic networks (MLNs) can be difficult to interpret, due to the often counter-intuitive meaning of their weights. To address this issue, we propose a method to construct a possibilistic logic theory that exactly captures what can be derived from a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996